• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:

    公开号:NL2011627A
    申请号:NL2011627
    申请日:2013-10-17
    公开日:2014-04-23
    发明作者:Yogy Namara；Iii Eugene Edward Marinelli
    申请人:Palantir Technologies；
    IPC主号:
    专利说明:

    SYSTEM AND METHOD FOR BATCH EVALUATION PROGRAMS
    BACKGROUND OF THE INVENTION Field of the Invention
    [0001] The present disclosure relates generally to data access and analysis and, more specifically, to a system and method for evaluating programs in batch.
    Description of the Related Art
    [0002] Software applications, such as financial analysis applications, allow users to create and interact with large software data objects. Such data objects organize data relevant to the software application and provide methods that allow operations to be performed on the data. In some situations, the operations are performed on a large set of data and require high processing power as well as high bandwidth access to a database.
    [0003] Typically, for the efficient processing of such operations, the bulk of the processing occurs on a server that is external to the computing device that executes the software application. In operation, the software application transmits calls associated with the operations to be performed on the data, and the calls are processed on the server. The results of the processing are then transmitted back to the software application for presentation to the user.
    [0004] One drawback to such an implementation is that the server receives and processes one call per operation to be performed. In situations where operations are performed on an extremely large set of data, serving a large amount of calls can slow down the server and, in some cases, crash the server. Such a scenario is extremely undesirable because the server is extremely slow and in some cases entirely unusable, thereby affecting the overall user experience.
    [0005] As the foregoing illustrates, what is needed in the art is a mechanism for efficiently managing and processing a large volume of calls to be processed on a server.
    SUMMARY OF THE INVENTION
    [0006] One embodiment of the invention is computer-implemented method for evaluating a program instruction within the stack evaluator. The method includes the steps of generating a call frame associated with the program instruction within a call stack, wherein the call frame includes a first expression specified by the program instruction, generating a child frame associated with the first expression within the call stack, receiving a modification to the child frame that sets the value of the first expression within the child frame, and processing the call frame based at least in part on the value of the first expression within the child frame.
    [0007] Advantageously, because a single batch processing request is transmitted to the application server for a group of similar expressions, the number of processing requests received by the application server is reduced. As a result, the application server is not burdened with a large amount of requests at any given time. Therefore, the overall processing efficiency of the application server is increased and the overall processing latency of the application server is reduced.
    BRIEF DESCRIPTION OF THE FIGURES
    [0008] So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
    [0009] Figure 1 illustrates a system that enables an application to be processed in batch-mode, according to one embodiment of the invention;
    [0010] Figure 2A illustrates a more detailed view of the stack evaluator of Figure 1, according to one embodiment of the invention;
    [0011] Figure 2B illustrates a more detailed view of the stack of Figure 2A, according to one embodiment of the invention;
    [0012] Figure 3 illustrates a more detailed view of the batching module of Figure 1, according to one embodiment of the invention;
    [0013] Figure 4 is an exemplary system within which the application of Figure 1 could execute, according to one embodiment of the invention;
    [0014] Figures 5A and 5B set forth a flow diagram of method steps for evaluating a program instruction within the stack evaluator, according to one embodiment of the invention; and
    [0015] Figures 6A and 6B set forth a flow diagram of method steps for processing related program instructions in batches, according to one embodiment of the invention.
    DESCRIPTION OF EXAMPLE EMBODIMENTS
    [0016] Figure 1 illustrates a system 100 that enables an application to be processed in batch-mode. As shown, the system 100 includes a application 102, service logic 104, an application server 106 and a data store 108.
    [0017] The application 102 is a software program that allows a user to create, analyze and interact with workflows having one or more documents. A document is typically composed of several data objects, each having a particular type and function. The data objects that could make up a document are described in greater detail below. A user, via a programming interface, can typically write program routines that interact with the data objects to generate the results or analysis needed. Again, some examples of such instructions are described below.
    [0018] The service logic 104 is an infrastructure layer that, among other things, allows the application 102 to communicate with the application server 106. In one embodiment, the service logic 104 includes a messaging service (not shown) that allows the application 102 and the application server 106 to communicate asynchronously via messages. The service logic 104 includes a stack evaluator 118 and a batching module 120. The stack evaluator 118 is an infrastructure module that manages the stack-based evaluation of program routines associated with the application 102. Each program routine is associated with a call stack that includes multiple frames, each frame storing information about a particular portion of the program routine. The batching module 120 allows for the batch processing on the application server 106 of program routines being evaluated within the stack evaluator 118. The functions of the stack evaluator 118 and the batching module 120 is described in greater detail below in conjunction with Figures 2A-6B.
    [0019] The application server 106 includes logical elements such as input receiving logic 110, an object model 112, evaluation logic 114 and data store access logic 116. The application server 106 may be implemented as a special-purpose computer system having the logical elements shown in Figure 1. In one embodiment, the logical elements comprise program instructions stored on one or more machine-readable storage media. Alternatively, the logical elements may be implemented in hardware, firmware, or a combination thereof.
    [0020] The input receiving logic 110 receives inputs from different applications executing within the system 100, such as the application 102, via the service logic 104. Inputs include, but are not limited to, processing requests, data access/storage requests and expression evaluation requests. The input receiving logic 110 transmits requests received from the different applications to logical elements within the application server 106 that are configured to process those requests.
    [0021] The object model 112 is a model that specifies a universe of data objects, relationships between the data objects, higher-order data objects generated based on one or more zero-order data objects in the universe, higher-order data objects generated based on other higher-order data objects, and auxiliary entities related to the universe of data objects. The data objects may be created by users via data object creation mechanisms exposed in different applications, such as the application 102. In one embodiment, the object model 112 includes only references to the data objects and data related to those data objects is stored within the data store 108. Persons skilled in the art would understand that any other data objects can be included in the object model 112.
    [0022] The evaluation logic 114 receives expression evaluation requests from applications, such as the application 102, via the input receiving logic and evaluates the expressions specifies in those requests. An expression typically includes a reference to one or more data objects included in the object model 112 and specifies one or more operations to be performed on those data objects. The evaluation logic 114, when processing a particular expression, may create, modify, delete and store data objects that are associated with the universe of data objects included in the object model 112. In addition, the evaluation logic 112 the evaluation logic 112 transmits the results of processing the particular expression to the application that transmitted the expression evaluation request.
    [0023] In an embodiment, application server 106 comprises data store access logic 116. Data store access logic 116 may comprise a set of program instructions which, when executed by one or more processors, are operable to access and retrieve data from data store 108. For example, data store access logic 116 may be a database client or an Open Database Connectivity (ODBC) client that supports calls to a database server that manages data store 108. Data store 108 may be any type of structured storage for storing data including, but not limited to, relational or object-oriented databases, data warehouses, directories, data files, and any other structured data storage.
    [0024] Figure 2A illustrates a more detailed view of the stack evaluator 118 of Figure 1, according to one embodiment of the invention. As shown, the stack evaluator 118 includes multiple stacks 202.
    [0025] The stack evaluator 118 generates a stack 202 corresponding to each program subroutine (referred to herein as a "subroutine") associated with the application 102. Typically, a subroutine includes multiple instructions, where each instruction includes one or more expressions to be evaluated. As discussed above, an expression may include an argument, a parameter and/or a metric, as described above. When evaluating a particular instruction, the stack evaluator 118 generates a different frame for each expression within that instruction. For example, an array frame is generated for each argument of an instruction and a call frame is generated for performing a specified operation on the arguments that were evaluated in the array frame(s).
    [0026] Figure 2B illustrates a more detailed view of a stack 202 of Figure 2A, according to one embodiment of the invention. As shown, the stack 202 includes a frames portion 206, a value portion 208 and an expression portion 210 .
    [0027] The frames portion 206 includes multiple frames 204, where each frame 204 corresponds to a particular evaluation iteration of the subroutine corresponding to the stack 202. When a particular frame is ready for evaluation, the stack 202 transitions to an "evaluation state." During evaluation, the expressions within the current frame are first extracted and pushed into the expression array 210, such as exp 214. The value of the expressions are then evaluated and pushed into the value array 208. If an expression being evaluated is nested, the evaluation of the expression in the current frame 204 generates one or more new frames 204 that are evaluated before evaluating the current frame. Once the evaluation of each frame in the stack 202 is completed, the stack 202 transitions to a "completed state"
    [0028] Figure 3 illustrates a more detailed view of the batching module 120 of Figure 1, according to one embodiment of the invention. As shown, the batching module 120 includes an inspection engine 302, a blocking engine 304 and an unblocking engine.
    [0029] The batching module 120 monitors the execution of program subroutines within the stack evaluator 118 to identify program subroutines that can be processed within the application server 106 in batch. More specifically, for each stack 202, the inspection engine 302 analyzes a current expression within a frame 204 of the stack 202 to determine whether the evaluation of the expression should be evaluated in batch with other similar expressions.
    [0030] To determine whether a particular expression should be evaluated in batch with other similar expressions, the inspection engine 302 first determines the type of the expression. An expression may be an economic index, an instrument, a metric, an input object, an output object, a parameter, a time series, a higher-order-object, or any higher-order object in the object model. Based on the type of expression, the inspection engine 302 then determines whether the type of the expression falls within a predetermined category of expressions that should be processed in batch with other expressions of the same type or a similar type. For example, an expression that includes a metric for which the evaluation involves a database access or a model access should be processed in batch with other expressions that include metrics for which the evaluation involves database accesses or a model accesses.
    [0031] As another example, consider the following program instruction: return this.close + this.open, where "this" refers to a time series. There are multiple expressions within the program instruction, such as "this. close," " + ," and "this.open." In one scenario, the program instruction may be evaluated multiple times, each evaluation generating a different stack 202. In such a scenario, the inspection engine 302 may identify the expressions "this.close" and "this.open" as expressions that should be evaluated in batch with similar expressions. Therefore, for each stack 202, the corresponding "this.close" expression is evaluated in batch with the "this.close" expressions in the remaining stacks 202. Similarly, for each stack 202, the corresponding "this.open" expression is evaluated in batch with the "this.open" expressions in the remaining stacks 202 .
    [0032] For a particular stack 202, once the inspection engine 302 determines that the current expression should be evaluated in batch with other similar expressions, the blocking engine 304 blocks the processing of the current expression and the stack 202, in general. At this instant, the stack 202 transitions to a "blocked state." Therefore, at any given point, a stack 202 is either in an evaluation state, a blocked state or a completed state. When all the stacks 202 are either in a blocked state or a completed state, the blocking engine 304 prepares the current expressions in each of the blocked stacks 202 (referred to herein as the "blocked expressions") for evaluation on the application server 106 in batch. The blocking engine 304 divides the blocked expressions into partitions, where blocked expressions in a particular partition are each associated with at least one similar characteristic. For example, each blocked expression in a particular partition may need a database call to be executed by the application server 106 .
    [0033] Once the blocked expressions are divided into partitions, the blocking engine 304 dispatches, per partition, a single call to the application server 106 for evaluating all of the expressions in that partition. The application server 106 evaluates the expression in a manner described above in conjunction with Figure 1. The application server 106 transmits the results associated with each expression in a partition to the unblocking engine 306. For each result associated with a particular expression, the unblocking engine 306 updates the stack 202 corresponding to the expression to store the result. The updated stack 202 is then unblocked and the frames 204 within the stack 202 continue to be processed.
    [0034] The inspection engine 302 continues to inspect the stacks 202 to identify expressions that can be evaluated in batch. In turn, the blocking engine 304 continues to block stacks 202 and dispatch calls for evaluating similar expressions in batch until each of the stacks 202 is in a completed state. In such a manner, similar expressions from different stacks 202 are processed in batch within the application server 106, thus increasing the efficiency of the overall system.
    [0035] Figure 4 is an exemplary system within which the application 102 of Figure 1 could execute, according to one embodiment of the invention. As shown, the system 400 includes a system memory 402, an external memory 404, a central processing unit (CPU) 406, an input device 410 and an display device 412.
    [0036] The system memory 402 includes the application 102 previously described herein. The system memory 402 is a memory space, usually a random access memory (RAM), that temporarily stores software programs running within the system 400 at any given time. The CPU 406 executes a sequence of stored instructions associated with and/or transmitted from the various elements in the computer system 400. The external memory 404 is a storage device, e.g. a hard disk, for storing data associated with the application 102. The input device 410 is an end-user controlled input device, e.g. a mouse or keyboard, that allows a user to manipulate various aspects of the application 102. The display device 412 may be a cathode-ray tube (CRT), a liquid crystal display (LCD) or any other type of display device.
    [0037] Figures 5A and 5B set forth a flow diagram of method steps for evaluating a program instruction within the stack evaluator, according to one embodiment of the invention. Although the method steps are described in conjunction with the system for Figure 1-4, persons skilled in the art will understand that any system configured to perform the method steps, in any order, is within the scope of the invention.
    [0038] The method 500 begins at step 501, where the stack evaluator 118 generates a stack 202 corresponding to a program subroutine associated with the application 102 that is being evaluated. At step 502, the stack evaluator 118 generates a call frame associated with a particular program instruction included in the program subroutine. As discussed above, each program instruction within a program subroutine includes one or more expressions to be evaluated. An expression may be an argument, a parameter and/or a metric, as described above. Therefore, the call frame associated with the particular program instruction includes the one or more expressions to be evaluated.
    [0039] At step 504, the stack evaluator 118 generates a different child frame for evaluating each expression within that instruction. For example, an array frame is generated for each argument of an instruction. At step 506, the stack evaluator 118 transitions the stack 202 to an evaluation state. At step 508, the stack evaluator 118 begins the evaluation of an expression included in a next child frame to be evaluated (referred to herein as the "current frame"). An expression is evaluated either within the stack evaluator 118 itself or needs to be processed within the application server 106 as described above in conjunction with Figure 1.
    [0040] At step 510, the stack evaluator 118 receives a request from the inspection engine 302 to inspect the current frame. As described above, each time a new frame is being evaluated, the inspection engine analyzes a current expression that is to be evaluated within the frame to determine whether the evaluation of the expression should be executed in batch with other similar expressions. The process of inspection and batch execution is described in detail with respect to Figures 6A and 6B.
    [0041] At step 512, the stack evaluator 118 determines whether the stack 202 is in a blocked state. As discussed above and described in greater detail with respect to Figures 6A and 6B, for a particular stack 202, if the inspection engine 302 determines that the current expression should be evaluated in batch with other similar expressions, then the blocking engine 304 blocks the processing of the current expression and the stack 202, in general. If, at step 512, the stack evaluator 118 determines that the stack 202 is in a blocked state, then the method 500 proceeds to step 514, where the stack evaluator 118 waits until the stack 202 is unblocked by the unblocking engine 306.
    However, if, at step 512, the stack evaluator 118 determines that the stack 202 is not in a blocked state, then the method 500 proceeds to step 516, where the stack evaluator 118 completes the evaluation of the expression in the current frame.
    [0042] At step 518, the stack evaluator 118 determines whether any child frames were generated at step 504 are still not evaluated. If so, then the method proceeds to step 508 previously described herein. If the stack evaluator 118 determines that all the child frames were generated at step 504 have been evaluated, then the method 500 proceeds to step 520. At step 520, the stack evaluator 118 determines whether the call frame that was generated at step 502 has been evaluated.
    [0043] If, at step 520, the stack evaluator 118 determines that the call frame that was generated at step 502 has not been evaluated, then the method 500 proceeds to step 522.
    At step 522, the stack evaluator 118 begins the evaluation of the call frame based on the expressions that were evaluated via the child frames. The method then proceeds to step 510 previously described herein.
    [0044] If, however, at step 520, the stack evaluator 118 determines that the call frame that was generated at step 502 has already been evaluated, then the method 500 proceeds to step 524. At step 524, the stack evaluator 118 transitions the state of the the stack 202 to the completed state. The method 500 then ends.
    [0045] As discussed above, the application 102 is associated with one or more program subroutines and each program subroutine includes multiple program instructions. Persons skilled in the art would recognize that the stack evaluator 118 executes the method steps described with respect to Figures 5A and 5B for each program instruction included in each program subroutine associated with the application 102, as discussed above.
    [0046] Figures 6A and 6B set forth a flow diagram of method steps for processing related program instructions in batches, according to one embodiment of the invention. Although the method steps are described in conjunction with the system for Figure 1-4, persons skilled in the art will understand that any system configured to perform the method steps, in any order, is within the scope of the invention.
    [0047] The method 600 begins at step 602, where the inspection engine 302, for each stack 202, inspects an expression within the stack 202 that is to be evaluated. At step 604, the inspection engine 302, based on the inspection, identifies one or more expressions included in the unblocked stacks that should be batch processed. As previously described, the inspections engine 302 identifies such expressions based on a type of the expression, the number of inputs specified in the expression, the type of operation to be performed, etc.
    [0048] At step 606, the blocking engine 304 blocks the processing of the expressions identified at step 604 and the stacks 202 that include those expressions. In one embodiment, the blocking engine 304 transitions the state of each of the stacks 202 to a blocked state. At step 606, the blocking engine 304 determines whether all the stacks are in a blocked or completed state. If, at step 606, at least one stack is not in a blocked or completed state, then the method 600 returns to step 602. If, however, at step 606, all the stacks are in a blocked or completed state, then the method 600 proceeds to step 610.
    [0049] At step 610, the blocking engine 304 divides the expressions included in the blocked stacks into partitions, where expressions in a particular partition are each associated with at least one similar characteristic. For example, each blocked expression in a particular partition may be a database call to be executed by the application server 106. At step 612, once the blocked expressions are divided into partitions, the blocking engine 304 dispatches, for each partition, a single call to the application server 106 for evaluating each of the expressions in that partition in batch. The application server 106 evaluates the expression in a manner described above in conjunction with Figure 1.
    [0050] At step 614, the unblocking engine 306 receives, for each partition, the results for each expression in the partition. At step 616, for each received result, the unblocking engine 306 updates the stack 202 corresponding to the expression for which the result was generated to store the result. At step 618, the unblocking engine 306 unblocks each of the updated stacks 202, which then continue to be processed.
    [0051] Advantageously, because a single batch processing request is transmitted to the application server for a group of similar expressions, the number of processing requests received by the application server is reduced. As a result, the application server is not burdened with a large amount of requests at any given time. Therefore, the overall processing efficiency of the application server is increased and the overall processing latency of the application server is reduced.
    [0052] One embodiment of the invention may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and can be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive, flash memory, ROM chips or any type of solid-state non-volatile semiconductor memory) on which information is permanently stored; and (ii) writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive or any type of solid-state random-access semiconductor memory) on which alterable information is stored.
    [0053] Another embodiment of the invention may be implemented as a program product deployed for use over a network. In such an embodiment, the program product may be accessed via a web browser.
    [0054] The invention has been described above with reference to specific embodiments. Persons skilled in the art, however, will understand that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The foregoing description and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
    权利要求:
    Claims (20)
    [1]
    A computer-implemented method for evaluating a program instruction within the data structure evaluator (Eng .: "stack evaluator"), the method comprising: generating a call frame (Eng: "call frame") associated with the program instruction in a call data structure (Eng .: "call stack"), wherein the call frame comprises a first expression specified by the program instruction; generating a child frame (Eng: "child frame") associated with the first expression in the call data structure; receiving a modification to the child's frame that sets the value of the first expression in the child's frame, and processing the call frame based on at least in part the value of the first expression in the child's frame.
    [2]
    The method of claim 1, further comprising, after generating the child's frame associated with the first expression, causing the call data structure to transition to a data structure evaluation state.
    [3]
    The method of claim 2, further comprising determining that the child's frame processing is blocked.
    [4]
    The method of claim 3, wherein determining that the child's frame processing is blocked comprises determining that the call data structure has transitioned to a blocked state.
    [5]
    The method of claim 3, wherein, when the child's frame processing is blocked, the first expression is group-processed by an application server with one or more other expressions.
    [6]
    The method of claim 3, further comprising waiting for processing of the child frame to be unblocked for processing the call frame.
    [7]
    The method of claim 1, further comprising generating a second call frame associated with the program instruction in the call data structure, the call frame comprising a second expression specified by the program instruction, and generating a child frame which is associated with the second expression in the call data structure.
    [8]
    The method of claim 7, wherein processing the first expression comprises performing a database call.
    [9]
    The method of claim 1, further comprising receiving a request from a software module to inspect the child's frame, wherein the software module applies the modification to the child's frame in response to the child's frame inspection.
    [10]
    The method of claim 9, wherein the child frame inspection comprises analyzing one or more features associated with the first expression.
    [11]
    A computer-readable medium that stores instructions that, when executed by a processor, cause the processor to evaluate a program instruction in the data structure evaluator (Eng. "Stack evaluator") by performing the steps of: generating a call frame (Eng .: "call frame") associated with the program instruction in a call data structure (Eng .: "call stack"), wherein the call frame comprises a first expression specified by the program instruction; generating a child frame (Eng: "child frame") associated with the first expression in the call data structure; receiving a modification to the child's frame that sets the value of the first expression in the child's frame, and processing the call frame based on at least in part the value of the first expression in the child's frame.
    [12]
    The computer-readable medium of claim 11, further comprising, after generating the child frame associated with the first expression, causing the call data structure to transition to a data structure evaluation state.
    [13]
    The computer-readable medium of claim 12, further comprising determining that the child frame processing is blocked.
    [14]
    The computer-readable medium of claim 13, wherein determining that the child frame processing is blocked comprises determining that the call data structure has transitioned to a blocked state.
    [15]
    The computer-readable medium of claim 13, wherein, when the child's frame processing is blocked, the first expression is group-processed by an application server with one or more other expressions.
    [16]
    The computer-readable medium of claim 13, further comprising waiting for processing of the child frame to be unblocked for processing the call frame.
    [17]
    The computer-readable medium of claim 11, further comprising generating a second call frame associated with the program instruction in the call data structure, wherein the call frame comprises a second expression specified by the program instruction, and generating a child framework associated with the second expression in the call data structure.
    [18]
    The computer-readable medium of claim 11, further comprising receiving a request from a software module to inspect the child's frame, wherein the software module applies the modification to the child's frame in response to the child's frame inspection.
    [19]
    The computer-readable medium of claim 19, wherein the child frame inspection comprises analyzing one or more features associated with the first expression.
    [20]
    A computer system comprising: a memory; and a processor, which is arranged for: generating a call frame (Eng .: "call frame") associated with the program instruction in a call data structure (Eng: "call stack"), wherein the call frame is a first includes an expression specified by the program instruction; generating a child frame (Eng: "child frame") associated with the first expression in the call data structure; receiving a modification to the child's frame that sets the value of the first expression in the child's frame, and processing the call frame based on at least in part the value of the first expression in the child's frame.
    类似技术:
    公开号 | 公开日 | 专利标题
    US11182204B2|2021-11-23|System and method for batch evaluation programs
    NL2011627B1|2016-01-26|System and method for batch evaluation programs.
    Mattoso et al.2015|Dynamic steering of HPC scientific workflows: A survey
    US10956422B2|2021-03-23|Integrating event processing with map-reduce
    US9298768B2|2016-03-29|System and method for the parallel execution of database queries over CPUs and multi core processors
    US10346292B2|2019-07-09|Software component recommendation based on multiple trace runs
    US20070143246A1|2007-06-21|Method and apparatus for analyzing the effect of different execution parameters on the performance of a database query
    Yang et al.2018|Intermediate data caching optimization for multi-stage and parallel big data frameworks
    US20070250517A1|2007-10-25|Method and Apparatus for Autonomically Maintaining Latent Auxiliary Database Structures for Use in Executing Database Queries
    CN107209763B|2021-04-09|Rules for specifying and applying data
    US10191947B2|2019-01-29|Partitioning advisor for online transaction processing workloads
    Osman et al.2011|QuePED: Revisiting queueing networks for the performance evaluation of database designs
    CN107562532B|2020-11-27|Method and device for predicting hardware resource utilization rate of equipment cluster
    NZ616299B|2015-07-28|System and method for batch evaluation programs
    NZ616212B|2015-05-01|System and method for batch evaluation programs
    Almeida et al.2019|Performance analysis and optimization techniques for oracle relational databases
    EP3091449A1|2016-11-09|Operating a database system
    US20200311066A1|2020-10-01|Query execution including pause and detach operations after first data fetch
    US10534774B2|2020-01-14|Query performance degradation analysis timing
    US20140149360A1|2014-05-29|Usage of Filters for Database-Level Implementation of Constraints
    Adekoya2018|Understanding Spark System Performance for Image Processing in a Heterogeneous Commodity Cluster
    WO2021143199A1|2021-07-22|Method and apparatus for searching log, computer device, and storage medium
    Timcheck et al.2022|Reducing queuing impact in streaming applications with irregular dataflow
    Hansen et al.2006|Microsoft SQL Server 2005: Rethinking Code Placement
    同族专利:
    公开号 | 公开日
    GB2508293B|2015-04-08|
    NZ616299A|2015-04-24|
    HK1194178A1|2014-10-10|
    NL2011627B1|2016-01-26|
    GB201318666D0|2013-12-04|
    CA2829266C|2017-06-20|
    CA2829266A1|2014-04-22|
    US20140115589A1|2014-04-24|
    US9471370B2|2016-10-18|
    DE102013221057A9|2014-07-03|
    DE102013221057A1|2014-04-24|
    AU2013237710A1|2014-05-08|
    DE102013221057B4|2020-04-23|
    GB2508293A|2014-05-28|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US6321274B1|1996-06-28|2001-11-20|Microsoft Corporation|Multiple procedure calls in a single request|
    EP0575358B1|1991-03-12|1997-07-09|Wang Laboratories, Inc.|Database management system graphical query front end|
    US5426747A|1991-03-22|1995-06-20|Object Design, Inc.|Method and apparatus for virtual memory mapping and transaction management in an object-oriented database system|
    US5428737A|1991-10-16|1995-06-27|International Business Machines Corporation|Comprehensive bilateral translation between SQL and graphically depicted queries|
    JPH0689307A|1992-05-04|1994-03-29|Internatl Business Mach Corp <Ibm>|Device and method for displaying information in database|
    JP2710548B2|1993-03-17|1998-02-10|インターナショナル・ビジネス・マシーンズ・コーポレイション|Method for retrieving data and converting between Boolean algebraic and graphic representations|
    US5918225A|1993-04-16|1999-06-29|Sybase, Inc.|SQL-based database system with improved indexing methodology|
    US5794228A|1993-04-16|1998-08-11|Sybase, Inc.|Database system with buffer manager providing per page native data compression and decompression|
    US5794229A|1993-04-16|1998-08-11|Sybase, Inc.|Database system with methodology for storing a database table by vertically partitioning all columns of the table|
    US5911138A|1993-06-04|1999-06-08|International Business Machines Corporation|Database search facility having improved user interface|
    US5608899A|1993-06-04|1997-03-04|International Business Machines Corporation|Method and apparatus for searching a database by interactively modifying a database query|
    US5613105A|1993-06-30|1997-03-18|Microsoft Corporation|Efficient storage of objects in a file system|
    US6877137B1|1998-04-09|2005-04-05|Rose Blush Software Llc|System, method and computer program product for mediating notes and note sub-notes linked or otherwise associated with stored or networked web pages|
    US5742806A|1994-01-31|1998-04-21|Sun Microsystems, Inc.|Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system|
    US5560005A|1994-02-25|1996-09-24|Actamed Corp.|Methods and systems for object-based relational distributed databases|
    US5542089A|1994-07-26|1996-07-30|International Business Machines Corporation|Method and apparatus for estimating the number of occurrences of frequent values in a data set|
    US5875329A|1995-12-22|1999-02-23|International Business Machines Corp.|Intelligent batching of distributed messages|
    US5857329A|1997-03-14|1999-01-12|Deere & Company|One-piece combined muffler exhaust outlet and exhaust gas deflector|
    US6208985B1|1997-07-09|2001-03-27|Caseventure Llc|Data refinery: a direct manipulation user interface for data querying with integrated qualitative and quantitative graphical representations of query construction and query result presentation|
    US6236994B1|1997-10-21|2001-05-22|Xerox Corporation|Method and apparatus for the integration of information and knowledge|
    US6178519B1|1998-12-10|2001-01-23|Mci Worldcom, Inc.|Cluster-wide database system|
    KR100313198B1|1999-03-05|2001-11-05|윤덕용|Multi-dimensional Selectivity Estimation Using Compressed Histogram Information|
    US7418399B2|1999-03-10|2008-08-26|Illinois Institute Of Technology|Methods and kits for managing diagnosis and therapeutics of bacterial infections|
    US6560774B1|1999-09-01|2003-05-06|Microsoft Corporation|Verifier to check intermediate language|
    US7546353B2|1999-12-02|2009-06-09|Western Digital Technologies, Inc.|Managed peer-to-peer applications, systems and methods for distributed data access and storage|
    US6745382B1|2000-04-13|2004-06-01|Worldcom, Inc.|CORBA wrappers for rules automation technology|
    US8386945B1|2000-05-17|2013-02-26|Eastman Kodak Company|System and method for implementing compound documents in a production printing workflow|
    GB2366498A|2000-08-25|2002-03-06|Copyn Ltd|Method of bookmarking a section of a web-page and storing said bookmarks|
    US6976024B1|2000-10-12|2005-12-13|International Buisness Machines Corporation|Batch submission API|
    US6857120B1|2000-11-01|2005-02-15|International Business Machines Corporation|Method for characterizing program execution by periodic call stack inspection|
    US7370040B1|2000-11-21|2008-05-06|Microsoft Corporation|Searching with adaptively configurable user interface and extensible query language|
    US7299202B2|2001-02-07|2007-11-20|Exalt Solutions, Inc.|Intelligent multimedia e-catalog|
    US7499922B1|2001-04-26|2009-03-03|Dakota Software Corp.|Information retrieval system and method|
    US7877421B2|2001-05-25|2011-01-25|International Business Machines Corporation|Method and system for mapping enterprise data assets to a semantic information model|
    US7100147B2|2001-06-28|2006-08-29|International Business Machines Corporation|Method, system, and program for generating a workflow|
    US7155728B1|2001-06-28|2006-12-26|Microsoft Corporation|Remoting features|
    WO2003005279A1|2001-07-03|2003-01-16|Altaworks Corporation|System and methods for monitoring performance metrics|
    US20030023620A1|2001-07-30|2003-01-30|Nicholas Trotta|Creation of media-interaction profiles|
    US7028223B1|2001-08-13|2006-04-11|Parasoft Corporation|System and method for testing of web services|
    US7165101B2|2001-12-03|2007-01-16|Sun Microsystems, Inc.|Transparent optimization of network traffic in distributed systems|
    US7519589B2|2003-02-04|2009-04-14|Cataphora, Inc.|Method and apparatus for sociological data analysis|
    US20040012633A1|2002-04-26|2004-01-22|Affymetrix, Inc., A Corporation Organized Under The Laws Of Delaware|System, method, and computer program product for dynamic display, and analysis of biological sequence data|
    US7127467B2|2002-05-10|2006-10-24|Oracle International Corporation|Managing expressions in a database system|
    US8244895B2|2002-07-15|2012-08-14|Hewlett-Packard Development Company, L.P.|Method and apparatus for applying receiving attributes using constraints|
    GB0221257D0|2002-09-13|2002-10-23|Ibm|Automated testing|
    US7383513B2|2002-09-25|2008-06-03|Oracle International Corporation|Graphical condition builder for facilitating database queries|
    US20040088177A1|2002-11-04|2004-05-06|Electronic Data Systems Corporation|Employee performance management method and system|
    US7546607B2|2002-11-19|2009-06-09|Microsoft Corporation|Native code exposing virtual machine managed object|
    US7243093B2|2002-11-27|2007-07-10|International Business Machines Corporation|Federated query management|
    US20040126840A1|2002-12-23|2004-07-01|Affymetrix, Inc.|Method, system and computer software for providing genomic ontological data|
    US7099888B2|2003-03-26|2006-08-29|Oracle International Corporation|Accessing a remotely located nested object|
    US7369912B2|2003-05-29|2008-05-06|Fisher-Rosemount Systems, Inc.|Batch execution engine with independent batch execution processes|
    US20050021397A1|2003-07-22|2005-01-27|Cui Yingwei Claire|Content-targeted advertising using collected user behavior data|
    US7216133B2|2003-07-29|2007-05-08|Microsoft Corporation|Synchronizing logical views independent of physical storage representations|
    US8433703B1|2003-12-22|2013-04-30|Google Inc.|Recording user actions|
    US7343552B2|2004-02-12|2008-03-11|Fuji Xerox Co., Ltd.|Systems and methods for freeform annotations|
    US7085890B2|2004-02-19|2006-08-01|International Business Machines Corporation|Memory mapping to reduce cache conflicts in multiprocessor systems|
    US20050226473A1|2004-04-07|2005-10-13|Subramanyan Ramesh|Electronic Documents Signing and Compliance Monitoring Invention|
    GB2414576A|2004-05-25|2005-11-30|Arion Human Capital Ltd|Business communication monitoring system detecting anomalous communication patterns|
    US8161122B2|2005-06-03|2012-04-17|Messagemind, Inc.|System and method of dynamically prioritized electronic mail graphical user interface, and measuring email productivity and collaboration trends|
    US8055672B2|2004-06-10|2011-11-08|International Business Machines Corporation|Dynamic graphical database query and data mining interface|
    US7406592B1|2004-09-23|2008-07-29|American Megatrends, Inc.|Method, system, and apparatus for efficient evaluation of boolean expressions|
    US7512738B2|2004-09-30|2009-03-31|Intel Corporation|Allocating call stack frame entries at different memory levels to functions in a program|
    US7366723B2|2004-10-05|2008-04-29|Sap Ag|Visual query modeling for configurable patterns|
    US20060080616A1|2004-10-13|2006-04-13|Xerox Corporation|Systems, methods and user interfaces for document workflow construction|
    GB0422750D0|2004-10-13|2004-11-17|Ciphergrid Ltd|Remote database technique|
    CA2484694A1|2004-10-14|2006-04-14|Alcatel|Database ram cache|
    US20060129992A1|2004-11-10|2006-06-15|Oberholtzer Brian K|Software test and performance monitoring system|
    US7783679B2|2005-01-12|2010-08-24|Computer Associates Think, Inc.|Efficient processing of time series data|
    US7483028B2|2005-03-15|2009-01-27|Microsoft Corporation|Providing 1D and 2D connectors in a connected diagram|
    WO2006102270A2|2005-03-22|2006-09-28|Cooper Kim A|Performance motivation systems and methods for contact centers|
    US8020110B2|2005-05-26|2011-09-13|Weisermazars Llp|Methods for defining queries, generating query results and displaying same|
    US7571192B2|2005-06-15|2009-08-04|Oracle International Corporation|Methods and apparatus for maintaining consistency during analysis of large data sets|
    US20070005582A1|2005-06-17|2007-01-04|Honeywell International Inc.|Building of database queries from graphical operations|
    WO2006137530A1|2005-06-24|2006-12-28|Justsystems Corporation|Document processing apparatus|
    CN1913441A|2005-08-09|2007-02-14|张永敏|Continuous changed data set transmission and updating method|
    US20070094248A1|2005-09-26|2007-04-26|Bea Systems, Inc.|System and method for managing content by workflows|
    US20070178501A1|2005-12-06|2007-08-02|Matthew Rabinowitz|System and method for integrating and validating genotypic, phenotypic and medical information into a database according to a standardized ontology|
    US7870512B2|2005-12-28|2011-01-11|Sap Ag|User interface prototype using UI taxonomy|
    US7801912B2|2005-12-29|2010-09-21|Amazon Technologies, Inc.|Method and apparatus for a searchable data service|
    US7831917B1|2005-12-30|2010-11-09|Google Inc.|Method, system, and graphical user interface for identifying and communicating with meeting spots|
    US20070192281A1|2006-02-02|2007-08-16|International Business Machines Corporation|Methods and apparatus for displaying real-time search trends in graphical search specification and result interfaces|
    US7853573B2|2006-05-03|2010-12-14|Oracle International Corporation|Efficient replication of XML data in a relational database management system|
    US20070260582A1|2006-05-05|2007-11-08|Inetsoft Technology|Method and System for Visual Query Construction and Representation|
    US20120173381A1|2011-01-03|2012-07-05|Stanley Benjamin Smith|Process and system for pricing and processing weighted data in a federated or subscription based data source|
    US7853614B2|2006-11-27|2010-12-14|Rapleaf, Inc.|Hierarchical, traceable, and association reputation assessment of email domains|
    US7680939B2|2006-12-20|2010-03-16|Yahoo! Inc.|Graphical user interface to manipulate syndication data feeds|
    US8799871B2|2007-01-08|2014-08-05|The Mathworks, Inc.|Computation of elementwise expression in parallel|
    US8171418B2|2007-01-31|2012-05-01|Salesforce.Com, Inc.|Method and system for presenting a visual representation of the portion of the sets of data that a query is expected to return|
    CN101246486B|2007-02-13|2012-02-01|国际商业机器公司|Method and apparatus for improved process of expressions|
    US7689624B2|2007-03-01|2010-03-30|Microsoft Corporation|Graph-based search leveraging sentiment analysis of user comments|
    US20090006150A1|2007-06-29|2009-01-01|Sap Ag|Coherent multi-dimensional business process model|
    US8386996B2|2007-06-29|2013-02-26|Sap Ag|Process extension wizard for coherent multi-dimensional business process models|
    US7761525B2|2007-08-23|2010-07-20|International Business Machines Corporation|System and method for providing improved time references in documents|
    US20090083275A1|2007-09-24|2009-03-26|Nokia Corporation|Method, Apparatus and Computer Program Product for Performing a Visual Search Using Grid-Based Feature Organization|
    US8417715B1|2007-12-19|2013-04-09|Tilmann Bruckhaus|Platform independent plug-in methods and systems for data mining and analytics|
    US20090161147A1|2007-12-20|2009-06-25|Sharp Laboratories Of America, Inc.|Personal document container|
    US20090172674A1|2007-12-28|2009-07-02|International Business Machines Corporation|Managing the computer collection of information in an information technology environment|
    US7877367B2|2008-01-22|2011-01-25|International Business Machines Corporation|Computer method and apparatus for graphical inquiry specification with progressive summary|
    US20090193012A1|2008-01-29|2009-07-30|James Charles Williams|Inheritance in a Search Index|
    US20090199047A1|2008-01-31|2009-08-06|Yahoo! Inc.|Executing software performance test jobs in a clustered system|
    US9274923B2|2008-03-25|2016-03-01|Wind River Systems, Inc.|System and method for stack crawl testing and caching|
    US20090282068A1|2008-05-12|2009-11-12|Shockro John J|Semantic packager|
    US8499287B2|2008-06-23|2013-07-30|Microsoft Corporation|Analysis of thread synchronization events|
    US7908521B2|2008-06-25|2011-03-15|Microsoft Corporation|Process reflection|
    AU2009201514A1|2008-07-11|2010-01-28|Icyte Pty Ltd|Annotation system and method|
    US9383911B2|2008-09-15|2016-07-05|Palantir Technologies, Inc.|Modal-less interface enhancements|
    KR101495132B1|2008-09-24|2015-02-25|삼성전자주식회사|Mobile terminal and method for displaying data thereof|
    CN101685449B|2008-09-26|2012-07-11|国际商业机器公司|Method and system for connecting tables in a plurality of heterogeneous distributed databases|
    US9032254B2|2008-10-29|2015-05-12|Aternity Information Systems Ltd.|Real time monitoring of computer for determining speed and energy consumption of various processes|
    US8103962B2|2008-11-04|2012-01-24|Brigham Young University|Form-based ontology creation and information harvesting|
    US8805861B2|2008-12-09|2014-08-12|Google Inc.|Methods and systems to train models to extract and integrate information from data sources|
    US8312038B2|2008-12-18|2012-11-13|Oracle International Corporation|Criteria builder for query builder|
    US20100169376A1|2008-12-29|2010-07-01|Yahoo! Inc.|Visual search engine for personal dating|
    US8073857B2|2009-02-17|2011-12-06|International Business Machines Corporation|Semantics-based data transformation over a wire in mashups|
    US9268761B2|2009-06-05|2016-02-23|Microsoft Technology Licensing, Llc|In-line dynamic text with variable formatting|
    US8606804B2|2009-08-05|2013-12-10|Microsoft Corporation|Runtime-defined dynamic queries|
    US20110066497A1|2009-09-14|2011-03-17|Choicestream, Inc.|Personalized advertising and recommendation|
    US20110074811A1|2009-09-25|2011-03-31|Apple Inc.|Map Layout for Print Production|
    US9158816B2|2009-10-21|2015-10-13|Microsoft Technology Licensing, Llc|Event processing with XML query based on reusable XML query template|
    US20110131547A1|2009-12-01|2011-06-02|International Business Machines Corporation|Method and system defining and interchanging diagrams of graphical modeling languages|
    GB2476121A|2009-12-14|2011-06-15|Colin Westlake|Linking interactions using a reference for an internet user's web session|
    US20110208822A1|2010-02-22|2011-08-25|Yogesh Chunilal Rathod|Method and system for customized, contextual, dynamic and unified communication, zero click advertisement and prospective customers search engine|
    US8739118B2|2010-04-08|2014-05-27|Microsoft Corporation|Pragmatic mapping specification, compilation and validation|
    US20110258216A1|2010-04-20|2011-10-20|International Business Machines Corporation|Usability enhancements for bookmarks of browsers|
    US8626770B2|2010-05-03|2014-01-07|International Business Machines Corporation|Iceberg query evaluation implementing a compressed bitmap index|
    US8799867B1|2010-06-08|2014-08-05|Cadence Design Systems, Inc.|Methods, systems, and articles of manufacture for synchronizing softwareverification flows|
    US8352908B2|2010-06-28|2013-01-08|International Business Machines Corporation|Multi-modal conversion tool for form-type applications|
    CA2707916C|2010-07-14|2015-12-01|Ibm Canada Limited - Ibm Canada Limitee|Intelligent timesheet assistance|
    US20120078595A1|2010-09-24|2012-03-29|Nokia Corporation|Method and apparatus for ontology matching|
    US8719252B2|2010-10-22|2014-05-06|Daniel Paul Miranker|Accessing relational databases as resource description framework databases|
    US20120159449A1|2010-12-15|2012-06-21|International Business Machines Corporation|Call Stack Inspection For A Thread Of Execution|
    US8966486B2|2011-05-03|2015-02-24|Microsoft Corporation|Distributed multi-phase batch job processing|
    US20130024268A1|2011-07-22|2013-01-24|Ebay Inc.|Incentivizing the linking of internet content to products for sale|
    US9996807B2|2011-08-17|2018-06-12|Roundhouse One Llc|Multidimensional digital platform for building integration and analysis|
    US20130054551A1|2011-08-24|2013-02-28|Sap Ag|Global product database|
    GB201115083D0|2011-08-31|2011-10-19|Data Connection Ltd|Identifying data items|
    US8433702B1|2011-09-28|2013-04-30|Palantir Technologies, Inc.|Horizon histogram optimizations|
    US20130086482A1|2011-09-30|2013-04-04|Cbs Interactive, Inc.|Displaying plurality of content items in window|
    US8560494B1|2011-09-30|2013-10-15|Palantir Technologies, Inc.|Visual data importer|
    US8626545B2|2011-10-17|2014-01-07|CrowdFlower, Inc.|Predicting future performance of multiple workers on crowdsourcing tasks and selecting repeated crowdsourcing workers|
    US8965422B2|2012-02-23|2015-02-24|Blackberry Limited|Tagging instant message content for retrieval using mobile communication devices|
    US20130226944A1|2012-02-24|2013-08-29|Microsoft Corporation|Format independent data transformation|
    US9378526B2|2012-03-02|2016-06-28|Palantir Technologies, Inc.|System and method for accessing data objects via remote references|
    US9798768B2|2012-09-10|2017-10-24|Palantir Technologies, Inc.|Search around visual queries|
    US9471370B2|2012-10-22|2016-10-18|Palantir Technologies, Inc.|System and method for stack-based batch evaluation of program instructions|
    US9348677B2|2012-10-22|2016-05-24|Palantir Technologies Inc.|System and method for batch evaluation programs|
    US10108668B2|2012-12-14|2018-10-23|Sap Se|Column smart mechanism for column based database|
    US8639552B1|2013-01-24|2014-01-28|Broadvision, Inc.|Systems and methods for creating and sharing tasks|
    US9805407B2|2013-01-25|2017-10-31|Illumina, Inc.|Methods and systems for using a cloud computing environment to configure and sell a biological sample preparation cartridge and share related data|
    US20140244388A1|2013-02-28|2014-08-28|MetroStar Systems, Inc.|Social Content Synchronization|
    US9898167B2|2013-03-15|2018-02-20|Palantir Technologies Inc.|Systems and methods for providing a tagging interface for external content|
    US9501202B2|2013-03-15|2016-11-22|Palantir Technologies, Inc.|Computer graphical user interface with genomic workflow|
    US9792194B2|2013-10-18|2017-10-17|International Business Machines Corporation|Performance regression manager for large scale systems|
    US9105000B1|2013-12-10|2015-08-11|Palantir Technologies Inc.|Aggregating data from a plurality of data sources|
    US8924429B1|2014-03-18|2014-12-30|Palantir Technologies Inc.|Determining and extracting changed data from a data source|
    US20160026923A1|2014-07-22|2016-01-28|Palantir Technologies Inc.|System and method for determining a propensity of entity to take a specified action|US9383911B2|2008-09-15|2016-07-05|Palantir Technologies, Inc.|Modal-less interface enhancements|
    US8732574B2|2011-08-25|2014-05-20|Palantir Technologies, Inc.|System and method for parameterizing documents for automatic workflow generation|
    US8504542B2|2011-09-02|2013-08-06|Palantir Technologies, Inc.|Multi-row transactions|
    US8560494B1|2011-09-30|2013-10-15|Palantir Technologies, Inc.|Visual data importer|
    US9378526B2|2012-03-02|2016-06-28|Palantir Technologies, Inc.|System and method for accessing data objects via remote references|
    US9798768B2|2012-09-10|2017-10-24|Palantir Technologies, Inc.|Search around visual queries|
    US9471370B2|2012-10-22|2016-10-18|Palantir Technologies, Inc.|System and method for stack-based batch evaluation of program instructions|
    US9348677B2|2012-10-22|2016-05-24|Palantir Technologies Inc.|System and method for batch evaluation programs|
    US9092482B2|2013-03-14|2015-07-28|Palantir Technologies, Inc.|Fair scheduling for mixed-query loads|
    US9367463B2|2013-03-14|2016-06-14|Palantir Technologies, Inc.|System and method utilizing a shared cache to provide zero copy memory mapped database|
    US9740369B2|2013-03-15|2017-08-22|Palantir Technologies Inc.|Systems and methods for providing a tagging interface for external content|
    US8868486B2|2013-03-15|2014-10-21|Palantir Technologies Inc.|Time-sensitive cube|
    US9898167B2|2013-03-15|2018-02-20|Palantir Technologies Inc.|Systems and methods for providing a tagging interface for external content|
    US8909656B2|2013-03-15|2014-12-09|Palantir Technologies Inc.|Filter chains with associated multipath views for exploring large data sets|
    US9105000B1|2013-12-10|2015-08-11|Palantir Technologies Inc.|Aggregating data from a plurality of data sources|
    US8924429B1|2014-03-18|2014-12-30|Palantir Technologies Inc.|Determining and extracting changed data from a data source|
    US9348880B1|2015-04-01|2016-05-24|Palantir Technologies, Inc.|Federated search of multiple sources with conflict resolution|
    US9514205B1|2015-09-04|2016-12-06|Palantir Technologies Inc.|Systems and methods for importing data from electronic data files|
    US10558339B1|2015-09-11|2020-02-11|Palantir Technologies Inc.|System and method for analyzing electronic communications and a collaborative electronic communications user interface|
    US9772934B2|2015-09-14|2017-09-26|Palantir Technologies Inc.|Pluggable fault detection tests for data pipelines|
    US9678785B1|2015-11-30|2017-06-13|International Business Machines Corporation|Virtual machine resource allocation based on user feedback|
    US9652510B1|2015-12-29|2017-05-16|Palantir Technologies Inc.|Systems and user interfaces for data analysis including artificial intelligence algorithms for generating optimized packages of data items|
    US10554516B1|2016-06-09|2020-02-04|Palantir Technologies Inc.|System to collect and visualize software usage metrics|
    US9678850B1|2016-06-10|2017-06-13|Palantir Technologies Inc.|Data pipeline monitoring|
    US10621314B2|2016-08-01|2020-04-14|Palantir Technologies Inc.|Secure deployment of a software package|
    US10133782B2|2016-08-01|2018-11-20|Palantir Technologies Inc.|Techniques for data extraction|
    US11256762B1|2016-08-04|2022-02-22|Palantir Technologies Inc.|System and method for efficiently determining and displaying optimal packages of data items|
    US10552531B2|2016-08-11|2020-02-04|Palantir Technologies Inc.|Collaborative spreadsheet data validation and integration|
    US10373078B1|2016-08-15|2019-08-06|Palantir Technologies Inc.|Vector generation for distributed data sets|
    EP3282374A1|2016-08-17|2018-02-14|Palantir Technologies Inc.|User interface data sample transformer|
    US10650086B1|2016-09-27|2020-05-12|Palantir Technologies Inc.|Systems, methods, and framework for associating supporting data in word processing|
    US10152306B2|2016-11-07|2018-12-11|Palantir Technologies Inc.|Framework for developing and deploying applications|
    US10261763B2|2016-12-13|2019-04-16|Palantir Technologies Inc.|Extensible data transformation authoring and validation system|
    US11157951B1|2016-12-16|2021-10-26|Palantir Technologies Inc.|System and method for determining and displaying an optimal assignment of data items|
    US10509844B1|2017-01-19|2019-12-17|Palantir Technologies Inc.|Network graph parser|
    US10180934B2|2017-03-02|2019-01-15|Palantir Technologies Inc.|Automatic translation of spreadsheets into scripts|
    US10572576B1|2017-04-06|2020-02-25|Palantir Technologies Inc.|Systems and methods for facilitating data object extraction from unstructured documents|
    US10680970B1|2017-04-27|2020-06-09|EMC IP Holding Company LLC|Stack-based resource management system and method for a distributed computing environment|
    US10824604B1|2017-05-17|2020-11-03|Palantir Technologies Inc.|Systems and methods for data entry|
    US10534595B1|2017-06-30|2020-01-14|Palantir Technologies Inc.|Techniques for configuring and validating a data pipeline deployment|
    US10204119B1|2017-07-20|2019-02-12|Palantir Technologies, Inc.|Inferring a dataset schema from input files|
    US10754820B2|2017-08-14|2020-08-25|Palantir Technologies Inc.|Customizable pipeline for integrating data|
    US11016936B1|2017-09-05|2021-05-25|Palantir Technologies Inc.|Validating data for integration|
    US10552524B1|2017-12-07|2020-02-04|Palantir Technolgies Inc.|Systems and methods for in-line document tagging and object based data synchronization|
    US10783162B1|2017-12-07|2020-09-22|Palantir Technologies Inc.|Workflow assistant|
    US10360252B1|2017-12-08|2019-07-23|Palantir Technologies Inc.|Detection and enrichment of missing data or metadata for large data sets|
    US11176116B2|2017-12-13|2021-11-16|Palantir Technologies Inc.|Systems and methods for annotating datasets|
    US10853352B1|2017-12-21|2020-12-01|Palantir Technologies Inc.|Structured data collection, presentation, validation and workflow management|
    GB201800595D0|2018-01-15|2018-02-28|Palantir Technologies Inc|Management of software bugs in a data processing system|
    US10599762B1|2018-01-16|2020-03-24|Palantir Technologies Inc.|Systems and methods for creating a dynamic electronic form|
    US10885021B1|2018-05-02|2021-01-05|Palantir Technologies Inc.|Interactive interpreter and graphical user interface|
    US11263263B2|2018-05-30|2022-03-01|Palantir Technologies Inc.|Data propagation and mapping system|
    US11061542B1|2018-06-01|2021-07-13|Palantir Technologies Inc.|Systems and methods for determining and displaying optimal associations of data items|
    US10795909B1|2018-06-14|2020-10-06|Palantir Technologies Inc.|Minimized and collapsed resource dependency path|
    CN110825466B|2019-11-11|2021-11-02|腾讯科技（深圳）有限公司|Program jamming processing method and jamming processing device|
    法律状态:
    2021-06-02| MM| Lapsed because of non-payment of the annual fee|Effective date: 20201101 |
    优先权:
    申请号 | 申请日 | 专利标题
    US13/657,656|US9471370B2|2012-10-22|2012-10-22|System and method for stack-based batch evaluation of program instructions|
    US201213657656|2012-10-22|
    [返回顶部]